class Solution {
public:
	int rob(vector<int>& nums) {
		vector<int> dp(nums.size(),0);
		if (nums.size() < 1)
		{
			return 0;
		}
		if (nums.size() < 2)
		{
			return nums[0];
		}
		dp[0] = nums[0];
		dp[1] = max(nums[0],nums[1]);
		for (int i = 2;i<dp.size();++i)
		{
			dp[i] = max(dp[i -2] + nums[i], dp[i-1]);
		}
		int ans = 0;
		for (int i = 0;i<dp.size();++i)
		{
			ans = max(ans, dp[i]);
		}
		return ans;
	}
};